A Survey on Binary Tree Codings
نویسندگان
چکیده
منابع مشابه
Are binary codings universal?
It is common sense to notice that one needs fewer digits to code numbers in ternary than in binary; new names are about log 3 2 times shorter. Is this trade-off a consequence of the special coding scheme? The answer is negative. More generally, we argue that the answer to the question, stated in the title and formulated to the first author by C. Rackhoff, is in fact negative. The conclusion wil...
متن کاملOn powers of words occurring in binary codings of rotations
We discuss combinatorial properties of a class of binary sequences generalizing Sturmian sequences and obtained as a coding of an irrational rotation on the circle with respect to a partition in two intervals. We give a characterization of those having a finite index in terms of a two-dimensional continued fraction like algorithm, the so-called D-expansion. Then, we discuss powers occurring at ...
متن کاملOn Codings of Traces
The paper solves the main open problem of [BFG94]. We show that given two dependence alphabets (Σ, D) and (Σ′, D′), it is decidable whether there exists a strong coding h : M(Σ, D) −→ M(Σ′, D′) between the associated trace monoids. In fact, we show that the problem is NP-complete. (A coding is an injective homomorphism, it is strong if independent letters are mapped to independent traces.) We e...
متن کاملParallel Merge Sort on a Binary Tree On-Chip Network
Recently, advances in the microelectronics technology enable us to integrate increasingly more processor cores in a single chip. As the chip density continues to grow, the communication latency compared to the computation time is becoming a dominant factor in modern single chip multiprocessors systems. Consequently, networks on a chip (NoC) have been introduced as an alternative to shared busse...
متن کاملEmbedding a balanced binary tree on a bounded point set
Given an undirected planar graph G with n vertices and a set S of n points inside a simple polygon P , a point-set embedding of G on S is a planar drawing of G such that each vertex is mapped to a distinct point of S and the edges are polygonal chains surrounded by P . A special case of the embedding problem is that in which G is a balanced binary tree. In this paper, we present a new algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1991
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/34.5.438